A minimax job completion-time problem revisited
نویسندگان
چکیده
منابع مشابه
A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملThe Constrained Minimum Weighted Sum of Job Completion Times Problem
We consider the problem of minimizing the weighted sum of job completion times on a single machine (subject to certain job weights) with an additional side constraint on the weighted sum of job completion times (with respect to different job weights). This problem is NP-hard, and we provide a polynomial time approximation scheme for this problem. Our method is based on Lagrangian relaxation mix...
متن کاملTime to completion reveals problem-solving transfer
Two equally skilled groups of students taking introductory mechanics solve related physics problem pairs in reverse order with respect to each other, using the web-based Socratic tutor, MasteringPhysics. In tutorial problems containing help in the form of requestable hints, descriptive text, and feedback, twice as many students were able to complete problems correctly in real-time compared to p...
متن کاملNormalized Completion Revisited
Normalized completion (Marché 1996) is a widely applicable and efficient technique for completion modulo theories. If successful, a normalized completion procedure computes a rewrite system that allows to decide the validity problem using normalized rewriting. In this paper we consider a slightly simplified inference system for finite normalized completion runs. We prove correctness, show faith...
متن کاملOn-line scheduling to minimize average completion time revisited
We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1988
ISSN: 0893-9659
DOI: 10.1016/0893-9659(88)90070-5